Some Almost-sure Convergence Properties Useful in Sequential Analysis

نویسندگان

  • Seong-Hee Kim
  • Barry L. Nelson
  • James R. Wilson
چکیده

Kim and Nelson propose sequential procedures for selecting the simulated system with the largest steady-state mean from a set of alternatives that yield stationary output processes. Each procedure uses a triangular continuation region so that sampling stops when the relevant test statistic first reaches the region’s boundary. In applying the generalized continuous mapping theorem to prove the asymptotic validity of these procedures as the indifference-zone parameter tends to zero, we are given (i) a sequence of functions on the unit interval (which are right-continuous with left-hand limits) converging to a realization of a certain Brownian motion process with drift; and (ii) a sequence of triangular continuation regions corresponding to the functions in sequence (i) and converging to the triangular continuation region for the Brownian motion process. From each function in sequence (i) and its corresponding continuation region in sequence (ii), we obtain the associated boundary-hitting point; and we prove that the resulting sequence of such points converges almost surely to the boundary-hitting point for the Brownian motion process. We also discuss the application of this result to a statistical process-control scheme for autocorrelated data and to other selection procedures for steady-state simulation experiments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Almost Sure Convergence of Kernel Bivariate Distribution Function Estimator under Negative Association

Let {Xn ,n=>1} be a strictly stationary sequence of negatively associated random variables, with common distribution function F. In this paper, we consider the estimation of the two-dimensional distribution function of (X1, Xk+1) for fixed $K /in N$ based on kernel type estimators. We introduce asymptotic normality and properties and moments. From these we derive the optimal bandwidth...

متن کامل

The Almost Sure Convergence for Weighted Sums of Linear Negatively Dependent Random Variables

In this paper, we generalize a theorem of Shao [12] by assuming that is a sequence of linear negatively dependent random variables. Also, we extend some theorems of Chao [6] and Thrum [14]. It is shown by an elementary method that for linear negatively dependent identically random variables with finite -th absolute moment the weighted sums converge to zero as where and is an array of...

متن کامل

Online Supplement to “Some Almost-sure Convergence Properties Useful in Sequential Analysis”

Kim and Nelson[14] propose sequential procedures for selecting the simulated system with the largest steady-state mean from a set of alternatives that yield stationary output processes. Each procedure uses a triangular continuation region so that sampling stops when the relevant test statistic first reaches the region’s boundary. In applying the generalized continuous mapping theorem to prove t...

متن کامل

ON THE ALMOSTLY SURE CONVERGENCE OF THE SEQUENCE D_P,Q

In this paper, we will discuss the concept of almost sure convergence for specic groups of fuzzyrandom variables. For this purpose, we use the type of generalized Chebyshev inequalities.Moreover, we show the concept of almost sure convergence of weighted average pairwise NQDof fuzzy random variables.

متن کامل

THE ALMOST SURE CONVERGENCE OF WEIGHTED SUMS OF NEGATIVELY DEPENDENT RANDOM VARIABLES

In this paper we study the almost universal convergence of weighted sums for sequence {x ,n } of negatively dependent (ND) uniformly bounded random variables, where a, k21 is an may of nonnegative real numbers such that 0(k ) for every ?> 0 and E|x | F | =0 , F = ?(X ,…, X ) for every n>l.

متن کامل

A supermartingale approach to Gaussian process based sequential design of experiments

Gaussian process (GP) models have become a well-established framework for the adaptive design of costly experiments, and in particular, but not only, of computer experiments. GP-based sequential designs have been proposed for various objectives, such as global optimization (estimating the global maximum or maximizer(s) of a function), reliability analysis (estimating a probability of failure) o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005